Handling Relations over Finite Domains in the Rule-Based System ELAN

Toward a Rule-Based Solution of Dynami Constraint Hierar hies Over Finite Domains

Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains

Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particular relevant in practice when programs with variables are considered, where such transformations play a basic role in (offline) simplifications of logic programs. So far, such transformations of non-ground programs have...

Automati Generation of Rule - Based ConstraintSolvers over Finite

Learning preference relations over combinatorial domains

We address the problem of learning preference relations over multiattribute (or combinatorial) domains. We do so by making hypotheses about the dependence structure between attributes that the preference relation enjoys. The first hypothesis we consider is the simplest one, namely, separability (no dependences between attributes: the preference over the values of each attribute is independent o...

stability and attraction domains of traffic equilibria in day-to-day dynamical system formulation

در این پژوهش مسئله واگذاری ترافیک را از دید سیستم های دینامیکی فرمول بندی می کنیم.فرض کرده ایم که همه فاکتورهای وابسته در طول زمان ثابت باشند و تعادل کاربر را از طریق فرایند منظم روزبه روز پیگیری کنیم.دینامیک ترافیک توسط یک نگاشت بازگشتی نشان داده می شود که تکامل سیستم در طول زمان را نشان می دهد.پایداری تعادل و دامنه جذب را توسط مطالعه ویژگی های توپولوژیکی تکامل سیستم تجزیه و تحلیل می کنیم.پاید...